Convergence of Stochastic Runge-kutta Methods That Use an Iterative Scheme to Compute Their Internal Stage Values

نویسندگان

  • Kristian Debrabant
  • Anne Kværnø
  • KRISTIAN DEBRABANT
  • ANNE KVÆRNØ
چکیده

preprint numerics no. 4/2007 norwegian university of science and technology trondheim, norway Abstract. In the last years, implicit SRK methods have been developed both for strong and weak approximation. For these methods, the stage values are only given implicitly. However, in practice these implicit equations are solved by iterative schemes like simple iteration, modified Newton iteration or full Newton iteration. We employ a unifying approach for the construction of stochastic B-series which is valid both for Itô-and Stratonovich-SDEs and applicable both for weak and strong convergence to analyze the order of the iterated Runge-Kutta method. Moreover, the analytical techniques applied in this paper can be of use in many other similar contexts. 1. Introduction. In many applications, e.g., in epidemiology and financial mathematics , taking stochastic effects into account when modeling dynamical systems often leads to stochastic differential equations (SDEs). Therefore, in recent years, the development of numerical methods for the approximation of SDEs has become a field of increasing interest, see e.g [16, 22] and references therein. Many stochastic schemes fall into the class of stochastic Runge-Kutta (SRK) methods. SRK methods have been studied both for strong approximation [1, 10, 11, 16], where one is interested in obtaining good pathwise solutions, and for weak approximation [7, 9, 16, 19, 21, 30], which focuses on the expectation of functionals of solutions. For solving SDEs which are stiff, implicit SRK methods have to be considered, which also has been done both for strong [4, 11, 12] and weak [8, 12, 17] approximation. For these methods, the stage values are only given implicitly. However, in practice these implicit equations are solved by iterative schemes like simple iteration, modified Newton iteration or full Newton iteration. For the numerical solution of ODEs such iterative schemes have been studied by the means of B-series and rooted trees [13, 14] and it was shown that certain growth functions defined on trees give a precise description of the development of the iterations. The aim of the present paper is to do a similar analysis in the SDE case. In particular, it will be shown that the growth functions describing the iterative schemes are the same in the ODE and the SDE case. Let (Ω, A, P) be a probability space. We denote by (X(t)) t∈I the stochastic process which is the solution of either a d-dimensional Itô or Stratonovich SDE defined by

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

B-Series Analysis of Stochastic Runge-Kutta Methods That Use an Iterative Scheme to Compute Their Internal Stage Values

In recent years, implicit stochastic Runge–Kutta (SRK) methods have been developed both for strong and weak approximations. For these methods, the stage values are only given implicitly. However, in practice these implicit equations are solved by iterative schemes such as simple iteration, modified Newton iteration or full Newton iteration. We employ a unifying approach for the construction of ...

متن کامل

THE USE OF A RUNGE-KUTTA SCHEME FOR AN ODE-PDE MODEL OF SUPPLY CHAINS

Integrating various suppliers to satisfy market demand is of great importance for e ective supply chain management. In this paper, we consider the ODE-PDE model of supply chain and apply a classical explicit fourth-order Runge-Kutta scheme for the related ODE model of suppliers. Also, the convergence of the proposed method is proved. Finally a numerical example is studied to demonstrate the acc...

متن کامل

Fast Iterative Methods for Navier-Stokes Equations with SST Turbulence Model and Chemistry

The steady state compressible Navier-Stokes equations are solved with an explicit Runge-Kutta scheme accelerated by multigrid and an implicit preconditioner. Extensions are made to include a k-ω/SST turbulence model and chemical reactions. The implicit smoother enables the use of high CFL numbers yielding fast convergence. We present applications to turbulent solutions for flows about wings and...

متن کامل

Low rank Runge-Kutta methods, symplecticity and stochastic Hamiltonian problems with additive noise

In this paper we extend the ideas of Brugnano, Iavernaro and Trigiante in their development of HBVM(s, r) methods to construct symplectic Runge-Kutta methods for all values of s and r with s ≥ r. However, these methods do not see the dramatic performance improvement that HBVMs can attain. Nevertheless, in the case of additive stochastic Hamiltonian problems an extension of these ideas, which re...

متن کامل

AIAA 2004–0763 Practical Implementation and Improvement of Preconditioning Methods for Explicit Multistage Flow Solvers

Preconditioning methods can help explicit multistage multigrid flow solvers to achieve fast and accurate convergence for a wide range of Mach numbers including incompress-ible flows. The implementation of preconditioning methods and the corresponding matrix dissipation terms in existing flow solvers is a challenging task if good convergence rates are to be obtained. This task can be made more c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007